Bounded tag fair queueing for broadband packet switching networks
نویسندگان
چکیده
منابع مشابه
Deterministic time-varying packet fair queueing for integrated services networks
In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been proposed for QoS wirelinewireless networking. The basic notion in PFQ is that the bandwidth allocated ...
متن کاملQueueing analysis for multicast packet switching
The development of broadband transmission and ATM switching technologies opens up an opportunity for providing high bit-rate multipoint and multimedia services such as video conferencing. Also, wireless communication has the inherent advantage of multicast transmission and may be used for multipoint information services. We consider multicast packet switching for which an input may send the sam...
متن کاملA Self-Clocked Fair Queueing Scheme for Broadband Applications
A n ef ic ient fa i r queueing scheme which is feasible f o r broadband implementation i s proposed and i ts performance i s analyzed. W e define fairness in a selfcontained manner, eliminating the need f o r the hypothetical fluid-flow reference sys tem used in the present state of art and thereby removing the associated computational complexity. The scheme i s based on the adoption of an inte...
متن کاملFair Queueing Algorithms for QoS Support in Packet
SRIDHARAN, SAVITHA. Fair Queueing Algorithms for QoS Support in Packet Switched Networks. (Under the direction of Dr. Yannis Viniotis, in association with Agere Systems.) The rapid growth of telecommunications has led to a demand for convergence of voice, video and data integration over traditional data networks. This has strained the current packet-switched networks which are not very well-sui...
متن کاملFair Queueing Architectures for High-Speed Networks
High-speed links in emerging communication networks require simple and efficient algorithms for apportioning bandwidth to competing connections. A single link may carry traffic for thousands of connections with different quality-of-service parameters, requiring scalable switch architectures that avoid performing operations for every connection or cell during each transmission slot. Still, effec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Communications
سال: 2000
ISSN: 0140-3664
DOI: 10.1016/s0140-3664(99)00145-0